0.09/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.10	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.10/0.31	% Computer : n008.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1920
0.10/0.31	% WCLimit    : 240
0.10/0.31	% DateTime   : Wed Jul 30 09:37:04 EDT 2025
0.10/0.31	% CPUTime    : 
0.15/0.41	Running higher-order theorem proving
0.15/0.41	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.Omf30EvrVn/E---3.1_370.p
6.50/1.62	# Version: 3.0.0-ho
6.50/1.62	# Preprocessing class: HSMSSMSSSSSNSSA.
6.50/1.62	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
6.50/1.62	# Starting post_as_ho1 with 1200s (5) cores
6.50/1.62	# Starting post_as_ho12 with 240s (1) cores
6.50/1.62	# Starting new_ho_3 with 240s (1) cores
6.50/1.62	# Starting ehoh_best2_full_lfho with 240s (1) cores
6.50/1.62	# new_ho_3 with pid 455 completed with status 0
6.50/1.62	# Result found by new_ho_3
6.50/1.62	# Preprocessing class: HSMSSMSSSSSNSSA.
6.50/1.62	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
6.50/1.62	# Starting post_as_ho1 with 1200s (5) cores
6.50/1.62	# Starting post_as_ho12 with 240s (1) cores
6.50/1.62	# Starting new_ho_3 with 240s (1) cores
6.50/1.62	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
6.50/1.62	# Search class: HGUSF-FFMF21-SSSFFMBN
6.50/1.62	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
6.50/1.62	# Starting ehoh_best2_full_lfho with 124s (1) cores
6.50/1.62	# ehoh_best2_full_lfho with pid 461 completed with status 0
6.50/1.62	# Result found by ehoh_best2_full_lfho
6.50/1.62	# Preprocessing class: HSMSSMSSSSSNSSA.
6.50/1.62	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
6.50/1.62	# Starting post_as_ho1 with 1200s (5) cores
6.50/1.62	# Starting post_as_ho12 with 240s (1) cores
6.50/1.62	# Starting new_ho_3 with 240s (1) cores
6.50/1.62	# SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
6.50/1.62	# Search class: HGUSF-FFMF21-SSSFFMBN
6.50/1.62	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
6.50/1.62	# Starting ehoh_best2_full_lfho with 124s (1) cores
6.50/1.62	# Preprocessing time       : 0.001 s
6.50/1.62	
6.50/1.62	# Proof found!
6.50/1.62	# SZS status Theorem
6.50/1.62	# SZS output start CNFRefutation
6.50/1.62	thf(decl_sort1, type, a: $tType).
6.50/1.62	thf(decl_23, type, c0: a).
6.50/1.62	thf(decl_24, type, x: a).
6.50/1.62	thf(decl_25, type, cP: a > a > a).
6.50/1.62	thf(decl_26, type, esk1_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_27, type, esk2_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_28, type, esk3_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_29, type, esk4_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_30, type, esk5_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_31, type, esk6_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_32, type, esk7_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_33, type, esk8_1: (a > a > a > $o) > a).
6.50/1.62	thf(decl_34, type, esk9_1: (a > a > a > $o) > a).
6.50/1.62	thf(cS_INCL_LEM6_pme, conjecture, ((![X1:a, X2:a]:(((cP @ X1 @ X2)!=(c0)))&![X1:a, X2:a, X3:a, X4:a]:(((((X1)=(X2))&((X3)=(X4)))<=((cP @ X1 @ X3)=(cP @ X2 @ X4)))))=>(((x)=(c0))<=![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)<=(![X6:a, X7:a, X8:a]:(((X5 @ X6 @ X7 @ X8)<=(?[X9:a, X10:a, X11:a, X12:a, X13:a, X14:a]:(((((((X6)=(cP @ X9 @ X10))&((X7)=(cP @ X11 @ X12)))&(X5 @ X9 @ X11 @ X13))&(X5 @ X10 @ X12 @ X14))&((X8)=(cP @ X13 @ X14))))|(((X6)=(X8))&((X7)=(c0)))|(((X7)=(X8))&((X6)=(c0))))))&($true)))))), file('/export/starexec/sandbox/tmp/tmp.Omf30EvrVn/E---3.1_370.p', cS_INCL_LEM6_pme)).
6.50/1.62	thf(c_0_1, negated_conjecture, ~(((![X1:a, X2:a]:(((cP @ X1 @ X2)!=(c0)))&![X1:a, X2:a, X3:a, X4:a]:((((cP @ X1 @ X3)=(cP @ X2 @ X4))=>(((X1)=(X2))&((X3)=(X4))))))=>(![X5:a > a > a > $o]:(((![X6:a, X7:a, X8:a]:(((?[X9:a, X10:a, X11:a, X12:a, X13:a, X14:a]:(((((((X6)=(cP @ X9 @ X10))&((X7)=(cP @ X11 @ X12)))&(X5 @ X9 @ X11 @ X13))&(X5 @ X10 @ X12 @ X14))&((X8)=(cP @ X13 @ X14))))|(((X6)=(X8))&((X7)=(c0)))|(((X7)=(X8))&((X6)=(c0))))=>(X5 @ X6 @ X7 @ X8)))&$true)=>(X5 @ x @ c0 @ c0)))=>((x)=(c0))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_INCL_LEM6_pme])])).
6.50/1.62	thf(c_0_2, negated_conjecture, ![X31:a, X32:a, X33:a, X34:a, X35:a, X36:a, X37:a > a > a > $o]:(((((cP @ X31 @ X32)!=(c0))&((((X33)=(X34))|((cP @ X33 @ X35)!=(cP @ X34 @ X36)))&(((X35)=(X36))|((cP @ X33 @ X35)!=(cP @ X34 @ X36)))))&(((((((((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(esk3_1 @ X37))|((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk1_1 @ X37)=(esk3_1 @ X37))|((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(c0))|((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk2_1 @ X37)=(c0))|((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))))&(((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(esk3_1 @ X37))|((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk1_1 @ X37)=(esk3_1 @ X37))|((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(c0))|((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk2_1 @ X37)=(c0))|((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0)))))&(((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(esk3_1 @ X37))|(X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk1_1 @ X37)=(esk3_1 @ X37))|(X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(c0))|(X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk2_1 @ X37)=(c0))|(X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0)))))&(((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(esk3_1 @ X37))|(X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk1_1 @ X37)=(esk3_1 @ X37))|(X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(c0))|(X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk2_1 @ X37)=(c0))|(X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0)))))&(((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(esk3_1 @ X37))|((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk1_1 @ X37)=(esk3_1 @ X37))|((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk2_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(c0))|((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0))&(((esk1_1 @ X37)=(c0))|(((esk2_1 @ X37)=(c0))|((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37))))|~($true)|(X37 @ x @ c0 @ c0)))))&(~(X37 @ (esk1_1 @ X37) @ (esk2_1 @ X37) @ (esk3_1 @ X37))|~($true)|(X37 @ x @ c0 @ c0)))&((x)!=(c0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
6.50/1.62	thf(c_0_3, negated_conjecture, ![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|~((X5 @ (esk1_1 @ X5) @ (esk2_1 @ X5) @ (esk3_1 @ X5)))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_2])).
6.50/1.62	thf(c_0_4, negated_conjecture, ![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|~((X5 @ (esk1_1 @ X5) @ (esk2_1 @ X5) @ (esk3_1 @ X5))))), inference(cn,[status(thm)],[c_0_3])).
6.50/1.62	thf(c_0_5, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ X5)=(c0))|((esk1_1 @ X5)=(esk3_1 @ X5))|((esk3_1 @ X5)=(cP @ (esk8_1 @ X5) @ (esk9_1 @ X5)))|(X5 @ x @ c0 @ c0)|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_2])).
6.50/1.62	thf(c_0_6, negated_conjecture, ![X51:a > a > a > $o, X50:a > a > a > $o]:(((X51 @ x @ c0 @ c0)|(X50 @ x @ c0 @ c0)|~(((X51 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))))|(X50 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2)))))))))), inference(primitive_enumeration,[status(thm)],[c_0_4])).
6.50/1.62	thf(c_0_7, negated_conjecture, ![X1:a, X2:a]:(((cP @ X1 @ X2)!=(c0))), inference(split_conjunct,[status(thm)],[c_0_2])).
6.50/1.62	thf(c_0_8, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ X5)=(c0))|((esk3_1 @ X5)=(esk1_1 @ X5))|((esk3_1 @ X5)=(cP @ (esk8_1 @ X5) @ (esk9_1 @ X5)))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[c_0_5])).
6.50/1.62	thf(c_0_9, negated_conjecture, ![X21:a > a > a > $o, X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|(X21 @ x @ c0 @ c0)|~((X5 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])).
6.50/1.62	thf(c_0_10, negated_conjecture, ![X5:a > a > a > $o]:((((esk3_1 @ X5)=(esk1_1 @ X5))|((esk1_1 @ X5)=(c0))|(X5 @ x @ c0 @ c0)|((esk3_1 @ X5)!=(c0)))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
6.50/1.62	thf(c_0_11, negated_conjecture, ![X5:a > a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_9])).
6.50/1.62	thf(c_0_12, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11])])])).
6.50/1.62	thf(c_0_13, negated_conjecture, ![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|~(((X5 @ c0 @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0)))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0)))))))|((esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))!=(c0)))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_12])])])).
6.50/1.62	thf(c_0_14, negated_conjecture, ![X5:a > a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])])).
6.50/1.62	thf(c_0_15, negated_conjecture, ![X21:a > a > a > $o, X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|(X21 @ x @ c0 @ c0)|~((X21 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])).
6.50/1.62	thf(c_0_16, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_14])])])).
6.50/1.62	thf(c_0_17, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:((((Z0)!=(x))|(X5 @ Z0 @ Z1 @ Z2)))))=(x))|(X5 @ x @ c0 @ c0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_15])).
6.50/1.62	thf(c_0_18, negated_conjecture, ((x)!=(c0)), inference(split_conjunct,[status(thm)],[c_0_2])).
6.50/1.62	thf(c_0_19, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17])])]), c_0_18]), ['proof']).
6.50/1.62	# SZS output end CNFRefutation
6.50/1.62	# Parsed axioms                        : 5
6.50/1.62	# Removed by relevancy pruning/SinE    : 4
6.50/1.62	# Initial clauses                      : 25
6.50/1.62	# Removed in clause preprocessing      : 0
6.50/1.62	# Initial clauses in saturation        : 25
6.50/1.62	# Processed clauses                    : 2284
6.50/1.62	# ...of these trivial                  : 3
6.50/1.62	# ...subsumed                          : 1004
6.50/1.62	# ...remaining for further processing  : 1277
6.50/1.62	# Other redundant clauses eliminated   : 0
6.50/1.62	# Clauses deleted for lack of memory   : 0
6.50/1.62	# Backward-subsumed                    : 107
6.50/1.62	# Backward-rewritten                   : 0
6.50/1.62	# Generated clauses                    : 12454
6.50/1.62	# ...of the previous two non-redundant : 11329
6.50/1.62	# ...aggressively subsumed             : 0
6.50/1.62	# Contextual simplify-reflections      : 0
6.50/1.62	# Paramodulations                      : 4924
6.50/1.62	# Factorizations                       : 3
6.50/1.62	# NegExts                              : 530
6.50/1.62	# Equation resolutions                 : 101
6.50/1.62	# Disequality decompositions           : 0
6.50/1.62	# Total rewrite steps                  : 1230
6.50/1.62	# ...of those cached                   : 1225
6.50/1.62	# Propositional unsat checks           : 0
6.50/1.62	#    Propositional check models        : 0
6.50/1.62	#    Propositional check unsatisfiable : 0
6.50/1.62	#    Propositional clauses             : 0
6.50/1.62	#    Propositional clauses after purity: 0
6.50/1.62	#    Propositional unsat core size     : 0
6.50/1.62	#    Propositional preprocessing time  : 0.000
6.50/1.62	#    Propositional encoding time       : 0.000
6.50/1.62	#    Propositional solver time         : 0.000
6.50/1.62	#    Success case prop preproc time    : 0.000
6.50/1.62	#    Success case prop encoding time   : 0.000
6.50/1.62	#    Success case prop solver time     : 0.000
6.50/1.62	# Current number of processed clauses  : 989
6.50/1.62	#    Positive orientable unit clauses  : 8
6.50/1.62	#    Positive unorientable unit clauses: 0
6.50/1.62	#    Negative unit clauses             : 2
6.50/1.62	#    Non-unit-clauses                  : 979
6.50/1.62	# Current number of unprocessed clauses: 8692
6.50/1.62	# ...number of literals in the above   : 63447
6.50/1.62	# Current number of archived formulas  : 0
6.50/1.62	# Current number of archived clauses   : 288
6.50/1.62	# Clause-clause subsumption calls (NU) : 131450
6.50/1.62	# Rec. Clause-clause subsumption calls : 10076
6.50/1.62	# Non-unit clause-clause subsumptions  : 1046
6.50/1.62	# Unit Clause-clause subsumption calls : 157
6.50/1.62	# Rewrite failures with RHS unbound    : 0
6.50/1.62	# BW rewrite match attempts            : 5
6.50/1.62	# BW rewrite match successes           : 3
6.50/1.62	# Condensation attempts                : 0
6.50/1.62	# Condensation successes               : 0
6.50/1.62	# Termbank termtop insertions          : 970542
6.50/1.62	# Search garbage collected termcells   : 587
6.50/1.62	
6.50/1.62	# -------------------------------------------------
6.50/1.62	# User time                : 1.180 s
6.50/1.62	# System time              : 0.009 s
6.50/1.62	# Total time               : 1.188 s
6.50/1.62	# Maximum resident set size: 1956 pages
6.50/1.62	
6.50/1.62	# -------------------------------------------------
6.50/1.62	# User time                : 1.182 s
6.50/1.62	# System time              : 0.009 s
6.50/1.62	# Total time               : 1.191 s
6.50/1.62	# Maximum resident set size: 1732 pages
6.50/1.62	% E exiting
6.50/1.62	% E exiting
6.50/1.62	EOF